Discretized Markov Transformations

نویسنده

  • Hiroshi Fujisaki
چکیده

We define discretized Markov transformations and find an algorithm to give the number of maximal-period sequences based on discretized Markov transformations. In this report, we focus on discretized dyadic transformations and define a number-theoretic function related to the numbers of maximal-period sequences based on the discretized dyadic transformations. We also introduce the entropy of the maximal-period sequences based on discretized dyadic transformations.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Set-Valued Markov Chains and Negative Semitrajectories of Discretized Dynamical Systems

Computer simulation of dynamical systems involves a phase space which is the finite set of machine arithmetic. Rounding state values of the continuous system to this grid yields a spatially discrete dynamical system, often with different dynamical behaviour. Discretization of an invertible smooth system gives a system with set-valued negative semitrajectories. As the grid is refined, asymptotic...

متن کامل

Artifacts of Markov blanket filtering based on discretized features in small sample size applications

Markov blanket filtering based on discretized features (MBF) has been proposed as a feature selection strategy. Critical evaluation of MBF has demonstrated its contradictory and counterintuitive nature, which results in undesirable properties for small sample size applications such as classification based on microarray gene expression data. 2005 Elsevier B.V. All rights reserved.

متن کامل

Markovian Delay Prediction-Based Control of Networked Systems

A new Markov-based method for real time prediction of network transmission time delays is introduced. The method considers a Multi-Layer Perceptron (MLP) neural model for the transmission network, where the number of neurons in the input layer is minimized so that the required calculations are reduced and the method can be implemented in the real-time. For this purpose, the Markov process order...

متن کامل

Simulation or Cohort Models? Continuous Time Simulation and Discretized Markov Models to Estimate Cost-Effectiveness

The choice of model design for decision analytic models in cost-effectiveness analysis has been the subject of discussion. The current work addresses this issue by noting that, when time is to be explicitly modelled, we need to represent phenomena occurring in continuous time. Multistate models evaluated in continuous time might be used but closed form solutions of expected time in each state m...

متن کامل

Asymptotic Perron's Method and Simple Markov Strategies in Stochastic Games and Control

We introduce a modification of Perron's method, where semi-solutions are considered in a carefully defined asymptotic sense. With this definition, we can show, in a rather elementary way, that in a zero-sum game or a control problem (with or without model uncertainty), the value function over all strategies coincides with the value function over Markov strategies discretized in time. Therefore,...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004